Recognition of collapsible complexes is NP-complete
نویسنده
چکیده
We prove that it is NP-complete to decide whether a given (3-dimensional) simplicial complex is collapsible. This work extends a result of Malgouyres and Francés showing that it is NP-complete to decide whether a given simplicial complex collapses to a 1-complex.
منابع مشابه
A ug 2 00 8 d - collapsibility is NP - complete for d ≥ 4
A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d − 1 that is contained in a unique maximal face. We prove that the algorithmic question whether a given simplicial complex is d-collapsible is NP-complete for d ≥ 4 and polynomial time solvable for d ≤ 2. As an intermediate step, we prove that d-collaps...
متن کاملd-collapsibility is NP-complete for d>=4
A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d − 1 that is contained in a unique maximal face. We prove that the algorithmic question whether a given simplicial complex is d-collapsible is NP-complete for d ≥ 4 and polynomial time solvable for d ≤ 2. As an intermediate step, we prove that d-collaps...
متن کاملOn the Complexity of Recognition of 2-collapsibility
A simplicial complex is d-collapsible if it can be reduced to an empty simplex by repeatedly removing face of dimension less than d that it is contained in a unique maximal face. These complexes have been studied since every complex that is the nerve of a family of convex sets in R d is d-collapsible. We show that the question whether a given complex is 2-collapsible can be solved in polynomial...
متن کاملFailure Process of Stone Columns in Collapsible Soils
Many countries in the word have loose and unstable soils encompassing a wide range ofgeological materials, which when inundated, may collapse and cause very significant distress to the structure. Stone columns have been used to strengthen such soils; even so, there are still cases where failure has occurred. In this technical note, the process and causes of stone column failure in reinforcing c...
متن کاملVertex decompositions of two-dimensional complexes and graphs
We investigate families of two-dimensional simplicial complexes defined in terms of vertex decompositions. They include nonevasive complexes, strongly collapsible complexes of Barmak and Miniam and analogues of 2-trees of Harary and Palmer. We investigate the complexity of recognition problems for those families and some of their combinatorial properties. Certain results follow from analogous d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 55 شماره
صفحات -
تاریخ انتشار 2016